Nurse Scheduling by Cooperative GA with Effective Mutation Operator
نویسندگان
چکیده
منابع مشابه
Nurse Scheduling by Cooperative GA with Effective Virus Operator
This paper proposes effective genetic operators for cooperative genetic algorithm (GA) to solve a nurse scheduling problem. A clinical director of a medical department makes a duty schedule of all nurses of the department every month. Such the scheduling is very complex task. It takes one or two weeks to create the nurse schedule even by a veteran director. In conventional ways using the cooper...
متن کاملPeriodic Mutation Operator for Nurse Scheduling by Using Cooperative GA
This paper proposes an effective mutation operator for Cooperative Genetic Algorithm (CGA) to be applied to a practical Nurse Scheduling Problem (NSP). NSP is a complex combinatorial optimizing problem for which many requirements must be considered. The changes of the shift schedule yields various problems, for example, a drop in the nursing level. The author describes a technique of the reopti...
متن کاملEffective genetic operators of cooperative genetic algorithm for nurse scheduling
This paper proposes effective genetic operators for cooperative genetic algorithm (GA) to solve a nurse scheduling problem. A clinical director of a medical department makes a duty schedule of all nurses of the department every month. Such the scheduling is very complex task. It takes one or two weeks to create the nurse schedule even by a veteran director. In conventional ways using the cooper...
متن کاملAn Effective GA-Based Scheduling Algorithm for FlexRay Systems
An advanced communication system, the FlexRay system, has been developed for future automotive applications. It consists of timetriggered clusters, such as drive-by-wire in cars, in order to meet different requirements and constraints between various sensors, processors, and actuators. In this paper, an approach to static scheduling for FlexRay systems is proposed. Our experimental results show...
متن کاملAgent-based approach for cooperative scheduling
This paper studies the multi-factory production (MFP) network scheduling problem where a number of different individual factories join together to form a MFP network, in which these factories can operate more economically than operating individually. However, in such network which known as virtual production network with self-interested factories with transportation times, each individual facto...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2012
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.e95.d.1830